Subset Intersection Group Testing Strategy

Many a time, items can be classified as defective or non-defective and the objective is to identify all items, if any, in population. The concept of group testing deals with identifying such using minimum number tests. This paper proposes probabilistic through subset intersection strategy. proposed algorithm 'Subset Intersection Group Testing Strategy' dividing whole population, it positive, into different rows columns individually columns. Through this strategy, tests either always one when no found 1+r+c, where r c denote columns, at least found. algorithms are validated simulation for combinations size incidence probability an item being (p) implications drawn. results indicate that average total required smaller p small considerably increases increases. Therefore, values p, strategy more effective. Also, attempt made estimate upper bound various scenarios.